package Classic150;

import java.util.HashMap;
import java.util.Map;

public class 两数之和 {
    /*
        哈希表的基础应用
     */
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) return new int[]{map.get(target - nums[i]),i};
            map.put(nums[i], i);
        }
        return new int[2];
    }
}
